Induction of Logic Programs : FOIL and Related
نویسنده
چکیده
foil is a rst-order learning system that uses information in a collection of relations to construct theories expressed in a dialect of Prolog. This paper provides an overview of the principal ideas and methods used in the current version of the system, including two recent additions. We present examples of tasks tackled by foil and of systems that adapt and extend its approach.
منابع مشابه
Automated Debugging of Logic Programs via Theory Revision
This paper presents results on using a theory revision system to automatically debug logic programs. Forte is a recently developed system for revising function-free Horn-clause theories. Given a theory and a set of training examples, it performs a hillclimbing search in an attempt to minimally modify the theory to correctly classify all of the examples. Forte makes use of methods from propositi...
متن کاملTow-down Induction of Logic Programs from Incomplete Samples
We propose an ILP system FOIL-I, which induces logic programs by a top-down method from incomplete samples. An incomplete sample is constituted by some of positive examples and negative examples on a nite domain. FOIL-I has an evaluation function to estimate candidate de nitions, the function which is composition of an information-based function and an encoding complexity measure. FOILI uses a ...
متن کاملCombining Top-down and Bottom-up Techniques in Inductive Logic Programming
This paper describes a new method for inducing logic programs from examples which attempts to integrate the best aspects of existing ILP methods into a single coherent framework. In particular, it combines a bottomup method similar to Golem with a topdown method similar to Foil. It also includes a method for predicate invention similar to Champ and an elegant solution to the \noisy oracle" prob...
متن کاملAn induction system that learns programs in different programming languages using genetic programming and logic grammars
Genetic Programming (GP) and Inductive Logic Programming (ILP) have received increasing interest recently. Since their formalisms are so different, these two approaches cannot be integrated easily though they share many common goals and functionalities. A unification will greatly enhance their problem solving power. Moreover, they are restricted in the computer languages in which programs can b...
متن کاملHeuristic Based Induction of Answer Set Programs: From Default theories to combinatorial problems
Significant research has been conducted in recent years to extend Inductive Logic Programming (ILP) methods to induce Answer Set Programs (ASP). These methods perform an exhaustive search for the correct hypothesis by encoding an ILP problem instance as an ASP program. Exhaustive search, however, results in loss of scalability. In addition, the language bias employed in these methods is overly ...
متن کامل